Gl(n,q) and Increasing Subsequences in Nonuniform Random Permutations
نویسنده
چکیده
Connections between longest increasing subsequences in random permutations and eigenvalues of random matrices with complex entries have been intensely studied. This note applies properties of random elements of the finite general linear group to obtain results about the longest increasing subsequence in non-uniform random permutations.
منابع مشابه
Increasing Subsequences in Nonuniform Random Permutations
Connections between longest increasing subsequences in random permutations and eigenvalues of random matrices with complex entries have been intensely studied. This note applies properties of random elements of the finite general linear group to obtain results about the longest increasing and decreasing subsequences in non-uniform random permutations.
متن کامل3 1 Ja n 19 99 LONGEST INCREASING SUBSEQUENCES OF RANDOM COLORED PERMUTATIONS
Abstract. We compute the limit distribution for (centered and scaled) length of the longest increasing subsequence of random colored permutations. The limit distribution function is a power of that for usual random permutations computed recently by Baik, Deift, and Johansson (math.CO/9810105). In two–colored case our method provides a different proof of a similar result by Tracy and Widom about...
متن کاملLog-concavity and q-Log-convexity Conjectures on the Longest Increasing Subsequences of Permutations
Let Pn,k be the number of permutations π on [n] = {1, 2, . . . , n} such that the length of the longest increasing subsequences of π equals k, and let M2n,k be the number of matchings on [2n] with crossing number k. Define Pn(x) = ∑ k Pn,kx k and M2n(x) = ∑ k M2n,kx . We propose some conjectures on the log-concavity and q-log-convexity of the polynomials Pn(x) and M2n(x).
متن کاملLaw of large numbers for increasing subsequences of random permutations
Let the random variable Zn,k denote the number of increasing subsequences of length k in a random permutation from Sn, the symmetric group of permutations of {1, ..., n}. We show that V ar(Zn,kn ) = o((EZn,kn ) ) as n → ∞ if and only if kn = o(n 2 5 ). In particular then, the weak law of large numbers holds for Zn,kn if kn = o(n 2 5 ); that is, lim n→∞ Zn,kn EZn,kn = 1, in probability. We also ...
متن کاملWhen the Law of Large Numbers Fails for Increasing Subsequences of Random Permutations
Let the random variable Zn,k denote the number of increasing subsequences of length k in a random permutation from Sn, the symmetric group of permutations of {1, ..., n}. In a recent paper [4] we showed that the weak law of large numbers holds for Zn,kn if kn = o(n 2 5 ); that is, lim n→∞ Zn,kn EZn,kn = 1, in probability. The method of proof employed there used the second moment method and demo...
متن کامل